package com.da.javatest.leetCode;

/**
 * @author chenlida
 * @date 2019/1/12 10:59
 * @description
 */
public class Code421 {
    public int findMaximumXOR(int[] nums) {
        int max = 0;
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                max = Math.max(max, nums[i] ^ nums[j]);
            }
        }
        return max;
    }
}
